A New Burst Scheduling Algorithm for Edge/Core Node Combined Optical Burst Switched Networks

نویسندگان

  • SeoungYoung Lee
  • In-Yong Hwang
  • Hong-Shik Park
چکیده

The burst contention problem in Optical Burst Switching network is an intrinsically serious problem. Many researches have tried to solve this problem, however it have been known that avoiding the burst loss is very difficult issues in the current OBS network. To improve burst blocking rate, we consider the edge/core combined OBS network where the core node performs the edge node function as well. Through this architecture, available amount of data burst that the node generates can be expected with respect to offset-time of transit data bursts. Any researches for this area has not been performed, thus we propose a new data scheduling algorithm for the edge/core combined OBS network where data bursts that the node generates do not interrupt transit data bursts from previous nodes. We analyzed the data burst loss rate and the throughput in relation with the offset-time of transit data bursts. Results show that the loss rate of the data bursts is drastically reduced and the throughput improves when the offset-time of transit data bursts increases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of an Edge - Core Joint Node in OBS Networks

Optical burst switching (OBS) has been introduced as a short term implementable solution for future alloptical networks. Its performance evaluation received a considerable attention and does not seem to be weaken. In prevalent studies, an OBS network is strictly divided into edge and core domains, while practically for future alloptical mesh network deployments; this is not valid for most of no...

متن کامل

Segmentation-Based Non-Preemptive Scheduling Algorithms for Optical Burst-Switched Networks

One of the key components in the design of optical burst-switched nodes is the development of channel scheduling algorithms that can efficiently handle data burst contentions. Traditional scheduling techniques use approaches such as wavelength conversion and buffering to resolve burst contention. In this paper, we propose non-preemptive scheduling algorithms that use burst segmentation to resol...

متن کامل

Channel scheduling algorithms using burst segmentation and FDLs for optical burst-switched networks

Optical burst switching is a promising solution for terabit transmission of IP data bursts over WDM networks. One of the key components in the design of optical burst-switched nodes is the development of channel scheduling algorithms that can efficiently handle data burst contentions. Currently, traditional scheduling techniques use wavelength conversion and buffering to resolve burst contentio...

متن کامل

A Centrally-Scheduled Photonic Container Switched Architecture For The Core Transport Network

We use the concept of Containers (fixed size macro data unit) in a photonic burst switch for the core transport network. This Container is tailored to integrate the existing multiple protocol stacks as an intermediate transport mechanism between optical and link layers. The objective of our container based optical burst switch is to eliminate the multiple O/E/O conversions in the core network a...

متن کامل

nOBS: an ns2 based simulation tool for performance evaluation of TCP traffic in OBS networks

Performance evaluation of TCP traffic in OBS networks has been under intensive study, since TCP constitutes the majority of Internet traffic. As a reliable and publicly available simulator, ns2 has been widely used for studying TCP/IP networks; however ns2 lacks many of the components for simulating optical burst switching networks. In this paper, an ns2 based OBS simulation tool (nOBS), which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006